Literal Shuffle of Compressed Words
نویسندگان
چکیده
Straight-Line Programs (SLP) are widely used compressed representations of words. In this work we study the rational transformations and the literal shuffle of words compressed via SLP, proving that the first preserves the compression rate, while the second does not. As a consequence, we prove a tight bound for the descriptional complexity of 2D texts compressed via SLP. Finally, we observe that the Pattern Matching Problem for texts expressed by the literal shuffle of compressed words is NP-complete. However, we present a parameter-tractable algorithm for this problem, working in polynomial time whenever the length of the pattern is polynomially related to that of the text.
منابع مشابه
Associativity of Infinite Synchronized Shuffles and Team Automata
Motivated by different ways to obtain team automata from synchronizing component automata, we consider various definitions of synchronized shuffles of words. A shuffle of two words is an interleaving of their symbol occurrences which preserves the original order of these occurrences within each of the two words. In a synchronized shuffle, however, also two occurrences of one symbol, each from a...
متن کاملShuffle of Words and Araucaria Trees
The shuffle of words ,. . . , is the set of words obtained by interleaving the letters of these words such that the order of appearance of all letters of each word is respected. The study of the shuffle product of words leads to the construction of an automaton whose structure is deeply connected to a family of trees which we call araucarias. We prove many structural properties of this family o...
متن کاملThe History of the Idea of a Literal Connection between the Words “Ahmad” and “Paraclete” in the Qur’an and the Gospel of John
In recent years, some people, comparing the word “Ahmad” in a Quranic verse speaking of Jesus’ prophecy about Prophet Muhammad (Qur'an 61:6) with the word “Paraclete” in the Gospel of John (14:26, etc.), have tried to make a connection between them. They have ascribed to Muslims (and even to the Prophet himself) the idea that the word “Paraclete” is a distorted form of the word “periclete</...
متن کاملWord insertions and primitivity ∗
In this paper we consider relations between the operation of word insertion and primitivity. A necessary and sufficient condition under which the insertion u ← u of the word u into itself has maximum cardinality is obtained. The notion of insertion sequence is introduced and sufficient conditions under which an insertion sequence is a special type of language (regular, context-free, biprefix co...
متن کاملA Cohesion Graph Based Approach for Unsupervised Recognition of Literal and Non-literal Use of Multiword Expressions
We present a graph-based model for representing the lexical cohesion of a discourse. In the graph structure, vertices correspond to the content words of a text and edges connecting pairs of words encode how closely the words are related semantically. We show that such a structure can be used to distinguish literal and non-literal usages of multi-word expressions.
متن کامل